Two-dimensional affine frames for image analysis and synthesis
نویسندگان
چکیده
An affine-group-based design methodology of Gabor-type filter bank is presented for the purpose of image analysis and synthesis. Various tessellations of the combined spatial-feature space are considered. We combine ideas introduced by Daugman [J.G. Daugman, Uncertainty relation for resolution in space, spatial frequency, and orientation optimized by two-dimensional visual cortical filters, J. Opt. Soc. Am. 2 (7) (1985) 1160–1169], Lee [T.S. Lee, Image representation using 2D Gabor-wavelets, IEEE Trans. PAMI 18 (10) (1996) 959–971] and Manjunath and Ma [B.S. Manjunath, W.Y. Ma, Texture features browsing and retrieval of image data, IEEE Trans. PAMI 18 (8) (1996) 837–842], and extend them by applying the action of the full affine group on Gaborian-type mother wavelets. In this approach we adopt optimality criteria of minimal spatial-features combined uncertainty, as well as tightness of the frame tessellating this combined space. In this work, scalings in the x and y directions, allowing for independent dilations in these two directions, as well as rotations and translations are allowed. For each discrete set of scalings, rotations and translations the frame bounds are calculated. For frames where the frame operator is well approximated by a multiple of the identity, we use the same set of functions in the analysis and synthesis, as though the frame is equivalent to an orthogonal basis. Moreover, we show that in the case of independent scalings in the x and y directions, the number of dominant (characteristic) orientations of the filter bank may depend on scale. We further show that the orientation bandwidths thus obtained, resemble those attained under the constraint imposed by the uncertainty principle. © 2007 Elsevier Inc. All rights reserved.
منابع مشابه
Image Restoration with Two-Dimensional Adaptive Filter Algorithms
Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...
متن کاملG-frames and Hilbert-Schmidt operators
In this paper we introduce and study Besselian $g$-frames. We show that the kernel of associated synthesis operator for a Besselian $g$-frame is finite dimensional. We also introduce $alpha$-dual of a $g$-frame and we get some results when we use the Hilbert-Schmidt norm for the members of a $g$-frame in a finite dimensional Hilbert space.
متن کاملAnalysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model
Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...
متن کاملEnhanced ACS algorithms for plastic analysis of planar frames
In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...
متن کاملA METAHEURISTIC-BASED ARTIFICIAL NEURAL NETWORK FOR PLASTIC LIMIT ANALYSIS OF FRAMES
Despite the advantages of the plastic limit analysis of structures, this robust method suffers from some drawbacks such as intense computational cost. Through two recent decades, metaheuristic algorithms have improved the performance of plastic limit analysis, especially in structural problems. Additionally, graph theoretical algorithms have decreased the computational time of the process impre...
متن کامل